Polyhedral Loop Parallelization: The Fine Grain
نویسندگان
چکیده
A safe basis for automatic loop parallelization is the polyhedron model which represents the iteration domain of a loop nest as a polyhedron in Zn. However, turning the parallel loop program in the model to efficient code meets with several obstacles, due to which performance may deteriorate seriously – especially on distributed memory architectures. We introduce a fine-grained model of the computation performed and show how this model can be applied to create efficient code.
منابع مشابه
Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs - Parallel Architectures and Compilation Techniques, 1996., Proceedings of the 1996 Conference on
This paper proposes an optimal algorithm for detecting fine or medium grain paralellism in nested loops whose dependences are described by an approximation of distance vectors by polyhedra. In particulal; it is optimal for direction vectors, which generalizes Wolf and Lam’s algorithm to the case of several statements. I t relies on a dependence uniformization process and on parallelization tech...
متن کاملThe Potential of Synergistic Static, Dynamic and Speculative Loop Nest Optimizations for Automatic Parallelization
Research in automatic parallelization of loop-centric programs started with static analysis, then broadened its arsenal to include dynamic inspection-execution and speculative execution, the best results involving hybrid static-dynamic schemes. Beyond the detection of parallelism in a sequential program, scalable parallelization on many-core processors involves hard and interesting parallelism ...
متن کاملMultifor for Multicore
We propose a new programming control structure called “multifor”, allowing to take advantage of parallelization models that were not naturally attainable with the polytope model before. In a multifor-loop, several loops whose bodies are run simultaneously can be defined. Respective iteration domains are mapped onto each other according to a run frequency – the grain – and a relative position – ...
متن کاملCache Optimization for Coarse Grain Task Parallel Processing Using Inter-Array Padding
The wide use of multiprocessor system has been making automatic parallelizing compilers more important. To improve the performance of multiprocessor system more by compiler, multigrain parallelization is important. In multigrain parallelization, coarse grain task parallelism among loops and subroutines and near fine grain parallelism among statements are used in addition to the traditional loop...
متن کاملAdvanced Hybrid MPI/OpenMP Parallelization Paradigms for Nested Loop Algorithms onto Clusters of SMPs
The parallelization process of nested-loop algorithms onto popular multi-level parallel architectures, such as clusters of SMPs, is not a trivial issue, since the existence of data dependencies in the algorithm impose severe restrictions on the task decomposition to be applied. In this paper we propose three techniques for the parallelization of such algorithms, namely pure MPI parallelization,...
متن کامل